Obnoxious p-Median problems: valid inequalities and a Branch-and-Cut approach
نویسندگان
چکیده
The Obnoxious p-Median (OpM) problem is the repulsive counterpart of the more known attractive pmedian problem: given a set C of cities and a set F of possible locations for obnoxious plants, it consists in finding a p-cardinality subset of F , such that the sum of the distances between each city of C and the nearest site is maximised. Two alternative formulations for OpM and the proof of its NP-hardness are provided, along with a set of valid inequalities for the Branch-and-Cut algorithm used in solving the problem. The paper then presents the results of computational tests performed on a number of randomly generated instances of the problem. Keywords— Obnoxious Locations, Combinatorial Optimization, Branch-and-cut, p-Median.
منابع مشابه
A Branch-and-Cut Approach for Solving Railway Line-Planning Problems
A important strategic phase in the planning process of a railway operator is the development of a line plan, i.e., a set of routes (paths) in a network of tracks, operated at a given hourly frequency. We consider a model formulation of the line-planning problem where total operating costs are to be minimized. This model is solved with a branch-and-cut approach, for which we develop a variety of...
متن کاملLifted Cover Inequalities for 0-1 Integer Programs: Computation
We investigate the algorithmic and implementation issues related to the eeective and eecient use of lifted cover inequalities and lifted GUB cover inequalities in a branch-and-cut algorithm for 0-1 integer programming. We have tried various strategies on several test problems and we identify the best ones for use in practice. Branch-and-cut, with lifted cover inequalities as cuts, has been used...
متن کاملA Branch-and-Cut to the Point-to-Point Connection Problem on Multicast Networks∗
In multicast routing, one of the basic problems consists of sending data from a set of sources to a set of destinations with minimum cost. A formalization of this problem using graph theory is given by the nonfixed Point-to-Point Connection (PPC) Problem. The optimization version of this problem is known to be NP-hard, and it can be also applied in areas such as circuit switching and VLSI desig...
متن کاملADVANCED GRASP FOR THE OBNOXIOUS p-MEDIAN PROBLEM
The Obnoxious p-Median problem consists in selecting a subset of p facilities from a given set of possible locations, in such a way that the sum of the distances between each customer and its nearest facility is maximized. The problem is NP-hard and can be formulated as an integer linear program. It was introduced in the 1990s, and a branch and cut method coupled with a tabu search has been rec...
متن کاملBDDs in a Branch & Cut Framework
Branch & Cut is today’s state-of-the-art method to solve 0/1-integer linear programs. Important for the success of this method is the generation of strong valid inequalities, which tighten the linear programming relaxation of 0/1IPs and thus allow for early pruning of parts of the search tree. In this paper we present a novel approach to generate valid inequalities for 0/1IPs which is based on ...
متن کامل